A token based distributed mutual exclusion algorithm based on quorum agreements
نویسندگان
چکیده
Coteries may be used to construct permission based distributed mutual exclusion algorithms. One such algorithm is Maekawa's p N algorithm in which the co-terie is constructed based on nite projective planes. This paper presents a token based mutual exclusion algorithm which uses data structures similar to coter-ies, called quorum agreements. The performance of the algorithm depends upon the quorum agreements used. When a good quorum agreement is used, the overall performance of the algorithm compares favorably with the performance of other mutual exclusion algorithms.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملComparative Study of Mutual Exclusion Algorithms in Distributed Systems
Mutual Exclusion is an important phenomenon in distributed systems. In this paper, we analyze and compare various mutual exclusion algorithms in distributed systems. In permission based mutual exclusion process waits for permission from other processes to enter into a critical section. In token based mutual exclusion, a special message called token is passed over the system and process holding ...
متن کاملA Torus Quorum Protocol for Distributed Mutual Exclusion
Designing efficient and fault-tolerant algorithms for solving the mutual exclusion problem is an important issue in distributed systems. Many algorithms have been proposed in the literature, and they are being broadly classified into two types: token-based and permissionbased [5, 21]. In a token-based algorithm, the system uses a unique token to represent the privilege for the node possessing i...
متن کاملQuorum-Based Mutual Exclusion Algorithms: A Survey
The development of highly complex software, communication interfaces and the presence of low-cost processors are key factors towards the design of distributed applications. By distributing a computation, processes are permitted to run concurrently, share resources among themselves and at the same time working independent of each other. Distributed computations that involve sharing of resources ...
متن کاملA Distributed Deadlock Free Quorum Based Algorithm for Mutual Exclusion
Quorum-based mutual exclusion algorithms enjoy many advantages such as low message complexity and high failure resiliency. The use of quorums is a well-known approach to achieving mutual exclusion in distributed environments. Several distributed based quorum mutual exclusion was presented. The number of messages required by these algorithms require between 3 and 5 , where n is the size of under...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991